Placing Labels in Road Maps: Algorithms and Complexity
نویسندگان
چکیده
منابع مشابه
Placing Text Labels on Maps and Diagrams
Stuart Shieber Harvard University Cambridge, Massachusetts } Introduction } Tagging graphical objects with text labels is a fundamental task in the design of many types of informational graphics. This problem is seen in its most essential form in cartography, but it also arises frequently in the production of other informational graphics such as scatterplots. The quality of a labeling is determ...
متن کاملPlacing Text Labels an Maps and Diagrams using Genetic Algorithms with Masking
Cartographic label placement is one of the most time consuming tasks in the production of high quality maps and other high quality graphical displays It is essential that text labels used to identify various features and objects be placed in a clear and unobscured manner In this paper we are concerned with the placement of labels for point features Speci cally the point feature label placement ...
متن کاملA Zone-Based Approach for Placing Annotation Labels on Metro Maps
Hand-drawn metro map illustrations often employ both internal and external labels in a way that they can assign enough information such as textual and image annotations to each landmark. Nonetheless, automatically tailoring the aesthetic layout of both textual and image labels together is still a challenging task, due to the complicated shape of the labeling space available around the metro net...
متن کاملthe effect of task complexity on efl learners’ written task performance in terms of accuracy and complexity
هدف اصلی این تحقیق بررسی تاثیر افزایش میزان پیچیدگی تکالیف مکالمه محور بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 15 الی 18 سال درسطح pre-intermediate از طریق petو vhs تست به عنوان شرکت کنندگان در تحقیق انتخاب شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی دو تکلیف ساده و پیچیده را طی 2 جلسه انجام...
Label Placement in Road Maps
A road map can be interpreted as a graph embedded in the plane, in which each vertex corresponds to a road junction and each edge to a particular road segment. We consider the cartographic problem to place non-overlapping road labels along the edges so that as many road segments as possible are covered by labels. We show that this is NP -hard in general, but can be solved in polynomial time if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2020
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-020-00678-7